EROC: A Toolkit for Building NEATO Query Optimizers

نویسندگان

  • William J. McKenna
  • Louis Burger
  • Chi Hoang
  • Melissa Truong
چکیده

EROC (Extensible, Reusable Optimization Components) is a toolkit for building query optimizers. EROC’s components are C++ classes based on abstractions we have identified as central to query optimization, not only in relational DBMSs, but in extended relational and object-oriented DBMSs as well. I EROC’s use of C++ classes clarifies the mapping from application domain (optimization) abstractions to solution domain (EROC) abstractions, and these classes provide: (1) complex predicate definition and manipulation; (2) representations for common operators, such as join and groupby, and associated property derivation functions, including key derivation; (3) management of catalog and type information; (4) implementations of common algebraic equivalence rules, and (5) System Rand Volcano-style search strategies. The classes are designed to provide optimizer implementors reusability and extensibility through layering and inheritance. EROC provides much more functionality than previous optimization tools because at1 of Pemnission to copy without fee all 01 part of this material is granted provided thaf the copies are not made OT distributed fOT’ direct commercial advantage, the VLDB copyright notice and the title of the publication and ifs date appear, and notice is given that copying is by permission of the Ve’ery Large Data Base Endowment. To copy otherwise, OT to republish, sequires a fee .andbor special permission from fhe Endowment. Proceedings of the 22nd VLDB Conference Mumbai(Bombay), India, 1996 Melissa Truong NCR Corporation [email protected] EROC’s optimization classes are extensible and reusable, not just the search components. In addition to describing EROC’s architecture and software engineering, we also show how EROC’s classes were extended to build NEAT0 (New EROC-based Advanced Teradata Optimizer), a join optimizer for a massively parallel environment. Based on the extensions required we give an indication of the savings EROC, provided us. To show NEATO’s efficiency and effectiveness, we present results of optimizing complex TPC/D benchmark queries and show that NEAT0 easily searches the entire space of query execution plans. We outline plans for extensions to NEAT0 and overview how the flexibility of EROC will enable these extensions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifying the Optimization Principles of a DBMS Participating in a Multidatabase

A multidatabase query optimizer draws an abstract plan for a query, the fragments of which are optimized by the underlying autonomous databases. For this plan to yield a reasonable cost, the optimization principles of the local optimizers must be known. We propose a methodology for the identiication of the principles and heuristics used by an optimizer for join ordering. We establish a categori...

متن کامل

Specifying Rule-Based Query Optimizers in a Reflective Framework

Numerous structures for database query optimizers have been proposed. Many of those proposals aimed at automating the construction of query optimizers from some kind of speciication of optimizer behavior. These speciication frameworks do a good job of partitioning and modularizing the kinds of information needed to generate a query optimizer. Most of them represent at least part of this informa...

متن کامل

Developing a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information

With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...

متن کامل

Query Architecture Expansion in Web Using Fuzzy Multi Domain Ontology

Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...

متن کامل

Efficiently approximating query optimizer plan diagrams

Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to be a powerful metaphor for the analysis and redesign of modern optimizers, and are gaining currency in diverse industrial and academic institutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996